POOL OR NOT TO POOL ? “ THE BENEFITS OF COMBINING QUEUING AND SIMULATION ” Nico

نویسنده

  • Nico M. van Dijk
چکیده

“Should we pool separate queues into a single queue or not?” A question as practical as for daily-life situations such as at a bank, a hospital or a service center as well as for technical applications such as in manufacturing or call centers. A question that involves fundamental insights of queuing theory. A question that can only be answered in a realistic situation by simulation. A question that is still open for practical and fundamental research. A question that requires a hybrid combination of queuing and simulation. A question that in realistic situations not only benefits from but even requires a hybrid combination of analysis and simulation. This paper aims to illustrate that simulation and queuing theory can and should go hand in hand for a variety of practical problems, both in daily-life and industry. To this end, it will highlight real-life cases taken from daily-life situations (postal office or bank), administrative logistics (reengineering), transportation (railways) and call center analysis.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Simulation Study of Flow-Based Scheduling Algorithms

This paper presents a set of simulation studies for comparing the performance of several flow-based scheduling algorithms, namely Weighted Fair Queuing, Self-Clock Fair Queuing, Start-Time Fair Queuing, Virtual Clock, Worst-case Fair Weighted Fair Queuing and Worstcase Fair Weighted Fair Queuing-plus. These algorithms are being considered for IP networks supporting Quality of Service (QoS).

متن کامل

A New Heuristic Statistical Methodology for Optimizing Queuing Networks Using Discreet Event Simulation

Most of the real queuing systems include special properties and constraints, which can not be analyzed directly by using the results of solved classical queuing models. Lack of Markov chains features, unexponential patterns and service constraints, are the mentioned conditions. This paper represents an applied general algorithm for analysis and optimizing the queuing systems. The algorithm stag...

متن کامل

Cognitive Radio Access Optimization Using Multi-parameter Match Ability Estimation

In this paper, we formulate the optimal channel access of secondary user system in cognitive radio networks as the total reward maximization by Partially Observable Markov Decision Processes (POMDPs). Match Ability is proposed that takes allowable channel transmission rate and bit-error-rate (BER) required by receiving end into account. A heuristic greedy algorithm for channel access is propose...

متن کامل

The Effect of Queuing Mechanisms First in First out (FIFO), Priority Queuing (PQ) and Weighted Fair Queuing (WFQ) on Network’s Routers and Applications

The paper presents the simulation results of the comparison of three Queuing Mechanisms, First in First out (FIFO), Priority Queuing (PQ), and Weighted Fair Queuing (WFQ). Depending on their effects on the network’s Routers, the load of any algorithm of them over Router’s CPUs and memory usage, the delay occurred between routers when any algorithm has been used and the network application throu...

متن کامل

The Exponentiated Poisson-Lindley Distribution; Features and Applications in Reliability

Abstract. In this paper a new three-parameter lifetime distribution named “the Exponentialed Lindley-Poisson (E-LP) distribution” has been suggested that it has an  increasing, decreasing and invers bathtube hazard rate depending on the parameter values. The (E-LP) distribution has applications in economics, actuarial modeling, reliability modeling, lifetime and queuing problems and biological ...

متن کامل

Analysis and Simulation of a Fair Queuing Algorithm

The authors also provide a variety of simulation results in which they measure throughput, RTT, number of retransmissions and dropped packets with different simplistic topologies and with different combinations of flow control algorithms at end hosts. They simulate an underloaded gateway, overloaded gateway, ill-behaved source, mixed protocols, multihop path and complicated network. Overall the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002